Shape optimizationviaa levelset and a Gauss-Newton method
نویسندگان
چکیده
منابع مشابه
Phaseless Recovery Using the Gauss-Newton Method
Abstract. In this paper, we develop a concrete algorithm for phase retrieval, which we refer to as GaussNewton algorithm. In short, this algorithm starts with a good initial estimation, which is obtained by a modified spectral method, and then update the iteration point by a Gauss-Newton iteration step. We prove that a re-sampled version of this algorithm quadratically converges to the solution...
متن کاملA Gauss-Newton Method for Markov Decision Processes
Approximate Newton methods are a standard optimization tool which aim to maintain the benefits of Newton’s method, such as a fast rate of convergence, whilst alleviating its drawbacks, such as computationally expensive calculation or estimation of the inverse Hessian. In this work we investigate approximate Newton methods for policy optimization in Markov decision processes (MDPs). We first ana...
متن کاملConvergence analysis of a proximal Gauss-Newton method
An extension of the Gauss-Newton algorithm is proposed to find local minimizers of penalized nonlinear least squares problems, under generalized Lipschitz assumptions. Convergence results of local type are obtained, as well as an estimate of the radius of the convergence ball. Some applications for solving constrained nonlinear equations are discussed and the numerical performance of the method...
متن کاملA Gauss - Newton method for convex composite optimization 1
An extension of the Gauss-Newton method for nonlinear equations to convex composite optimization is described and analyzed. Local quadratic convergence is established for the minimization of h o F under two conditions, namely h has a set of weak sharp minima, C, and there is a regular point of the inclusion F(x) E C. This result extends a similar convergence result due to Womersley (this journa...
متن کاملA Gauss-Newton method for convex composite optimization
An extension of the Gauss{Newton method for nonlinear equations to convex composite optimization is described and analyzed. Local quadratic convergence is established for the minimization of h F under two conditions, namely h has a set of weak sharp minima, C, and there is a regular point of the inclusion F(x) 2 C. This result extends a similar convergence result due to Womersley which employs ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ESAIM: Control, Optimisation and Calculus of Variations
سال: 2019
ISSN: 1292-8119,1262-3377
DOI: 10.1051/cocv/2017014